Matrix Product-Form Solution for an LCFS-PR Single-Server Queue with Multiple Arrival Streams Governed by a Markov Chain
نویسنده
چکیده
This paper considers a stationary single-server queue with multiple arrival streams governed by a Markov chain, where customers are served on an LCFS preemptive-resume basis. Service times of customers from each arrival stream are generally distributed and service time distributions for different arrival streams may be different. Under these assumptions, it is shown that the stationary distribution of queue strings representing from which arrival stream each customer in the system arrived has a matrix product-form solution, where rate matrices constituting the matrix product-form solution are given in terms of the infinitesimal generator of a certain Markov chain. Compared with the previous works, the result in this paper is more general in the sense that general service time distributions are allowed, and it has the advantage of computational efficiency.
منابع مشابه
Matrix Product-Form Solutions for LCFS Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams
This paper considers three variants of last-come first-served (LCFS) preemptive service single-server queues, where customers are served under the LCFS preemptive resume (LCFS-PR), preemptive repeat-different (LCFS-PD), and preemptive repeat-identical (LCFS-PI) disciplines, respectively. These LCFS queues are fed by multiple batch Markovian arrival streams. Service times of customers from each ...
متن کاملStationary Queue Length in a Fifo Single Server Queue with Service Interruptions and Multiple Batch Markovian Arrival Streams
Abstract This paper considers a FIFO single-server queue with service interruptions and multiple batch Markovian arrival streams. The server state (on and off), the type of arriving customers and their batch size are assumed to be governed by a continuous-time Markov chain with finite states. To put it more concretely, the marginal process of the server state is a phase-type alternating Markov ...
متن کاملA Queuing Model with Markovian Arrival and LCFS Priority System and General Time for Service
We consider a single server queuing system with repeated attempts in which customers arrive according a Markov arrival process (MAP) and with a LCFS PR discipline. The service times are independent and have a common general distribution. After service completion time the server initiates his search time with an arbitrary distribution function. We consider two cases where the maximum number of r...
متن کاملDual Form of Markov Renewal Equations and an Application to Asymptotic Analysis of a Single-server Queue
Abstract We propose dual form of Markov renewal equations. While the dual form is theoretically equivalent to the classical standard form of Markov renewal equation, it is shown to be a useful tool for analysis of recent stochastic models. To demonstrate the power of the dual form of Markov renewal equations, we apply one to tail asymptotic analysis of the stationary workload distribution for a...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 42 شماره
صفحات -
تاریخ انتشار 2002